A decision method for the recognizability of sets defined by number systems
نویسندگان
چکیده
منابع مشابه
A Decision Method for the Unambiguity of Sets Defined by Number Systems
We show that it is decidable, given a number system N , whether or not there is an unambiguous number system equivalent to N . Category: F.4.3
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
solution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
investigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
On the Recognizability of Self-generating Sets
Let I be a finite set of integers and F be a finite set of maps of the form n 7→ ki n + `i with integer coefficients. For an integer base k ≥ 2, we study the k-recognizability of the minimal set X of integers containing I and satisfying φ(X) ⊆ X for all φ ∈ F . In particular, solving a conjecture of Allouche, Shallit and Skordev, we show under some technical conditions that if two of the consta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1986
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1986200403951